Even Kernels
نویسنده
چکیده
Given a graph G = (V,E), an even kernel is a nonempty independent subset V ′ ⊆ V , such that every vertex of G is adjacent to an even number (possibly 0) of vertices in V ′. It is proved that the question of whether a graph has an even kernel is NP-complete. The motivation stems from combinatorial game theory. It is known that this question is polynomial if G is bipartite. We also prove that the question of whether there is an even kernel whose size is between two given bounds, in a given bipartite graph, is NP-complete. This result has applications in coding and set theory.
منابع مشابه
ar X iv : h ep - p h / 99 06 40 9 v 1 1 7 Ju n 19 99 Exclusive evolution kernels in two - loop order : parity even sector
Exclusive evolution kernels in two-loop order: parity even sector. Abstract We complete the construction of the non-forward evolution kernels in next-to-leading order responsible for the scale dependence of e.g. parity even singlet distribution amplitudes. Our formalism is designed to avoid any explicit two-loop calculations employing instead conformal and supersymmetric constraints as well as ...
متن کاملCombinatorial game theory foundations applied to digraph kernels
Known complexity facts: the decision problem of the existence of a kernel in a digraph G = (V,E) is NP-complete; if all of the cycles of G have even length, then G has a kernel; and the question of the number of kernels is #P-complete even for this restricted class of digraphs. In the opposite direction, we construct game theory tools, of independent interest, concerning strategies in the prese...
متن کاملFinite p-groups with few non-linear irreducible character kernels
Abstract. In this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.
متن کاملTravel-Time and Amplitude Sensitivity Kernels
The leading objective of this project is to rigorously study the asymptotic behavior of wave-theoretic travel-time sensitivity kernels with increasing range, as a means to explain their observed convergence towards the corresponding ray-theoretic sensitivity kernels even at low frequencies. Further objectives include the derivation and study of 2D and 3D first-order amplitude sensitivity kernel...
متن کاملNew estimates for the maximal singular integral
In this paper we pursue the study of the problem of controlling the maximal singular integral T ∗f by the singular integral Tf . Here T is a smooth homogeneous Calderón-Zygmund singular integral of convolution type. We consider two forms of control, namely, in the L2(Rn) norm and via pointwise estimates of T ∗f by M(Tf) or M2(Tf) , where M is the Hardy-Littlewood maximal operator and M2 = M ◦M ...
متن کامل2 Game Theory Foundations and Digraph Kernels
Known facts: the decision problem of the existence of a kernel in a digraph G = (V; E) is NP-complete; if all of the cycles of G have even length, then G has a kernel; and the question of the number of kernels is #P-complete even for this restricted class of digraphs. We construct game theory tools, of independent interest, concerning strategies in the presence of draw positions, to show, in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 1 شماره
صفحات -
تاریخ انتشار 1994